Characterization and Generalization of Honeycomb and Diamond Networks

Honeycomb (2D) and diamond (3D) networks constitute alternatives to mesh and torus architectures for paraUel processing. When wraparound links are zncluded in honeycomb and diamond networks, the resulting structures can be viewed as having been derived via a systematic pruning scheme applied to 2D and 3D tori. respectively. Link removal. which is performed along a diagonal pruning direction, preserves the network's node-symmetry and diameter, while reducing its implementation complexity and VLSI layout area. In this paper, we regard honeycomb and diamond networks as subgrapfis of complete 2D and 3D tori, respectively. and show this viewpoint to hold important lmplications for their physical layouts. routing schemes, and proof of topological properties.